Pii: S0925-7721(99)00044-9
نویسندگان
چکیده
Models of real-world objects and actions for use in graphics, virtual and augmented reality and related fields can only be obtained through the use of visual data and particularly video. This paper examines the question of recovering shape models from video information. Given video of an object or a scene captured by a moving camera, a prerequisite for model building is to recover the three-dimensional (3D) motion of the camera which consists of a rotation and a translation at each instant. It is shown here that a spherical eye (an eye or system of eyes providing panoramic vision) is superior to a camera-type eye (an eye with restricted field of view such as a common video camera) as regards the competence of 3D motion estimation. This result is derived from a geometric/statistical analysis of all the possible computational models that can be used for estimating 3D motion from an image sequence. Regardless of the estimation procedure for a camera-type eye, the parameters of the 3D rigid motion (translation and rotation) contain errors satisfying specific geometric constraints. Thus, translation is always confused with rotation, resulting in inaccurate results. This confusion does not happen for the case of panoramic vision. Insights obtained from this study point to new ways of constructing powerful imaging devices that suit particular tasks in visualization and virtual reality better than conventional cameras, thus leading to a new camera technology. Such new eyes are constructed by putting together multiple existing video cameras in specific ways, thus obtaining eyes from eyes. For a new eye of this kind we describe an implementation for deriving models of scenes from video data, while avoiding the correspondence problem in the video sequence. 2000 Elsevier Science B.V. All rights reserved.
منابع مشابه
New eyes for building models from video
Models of real-world objects and actions for use in graphics, virtual and augmented reality and related elds can only be obtained through the use of visual data and particularly video. This paper examines the question of recovering shape models from video information. Given video of an object or a scene captured by a moving camera, a prerequisite for model building is to recover the three-dimen...
متن کاملPii: S0925-7721(01)00044-x
We present two algorithms for packing two largest disks in a polygon. The first algorithm locates two disks in a simple polygon in time O(n log2 n) improving the best previous deterministic result (Bespamyatnikh, 1999) by a factor of logn. The second algorithm finds two disks in a convex polygon such that the disks are separated by a diagonal of the polygon. It runs in time O(n log2 n) improvin...
متن کاملOn the development of the intersection of a plane with a polytope
Define a “slice” curve as the intersection of a plane with the surface of a polytope, i.e., a convex polyhedron in three dimensions. We prove that a slice curve develops on a plane without self-intersection. The key tool used is a generalization of Cauchy’s arm lemma to permit nonconvex “openings” of a planar convex chain.
متن کاملPii: S0925-7721(00)00010-9
We improve previous lower bounds on the number of simple polygonizations, and other kinds of crossing-free subgraphs, of a set of N points in the plane by analyzing a suitable configuration. We also prove that the number of crossing-free perfect matchings and spanning trees is minimum when the points are in convex position. 2000 Elsevier Science B.V. All rights reserved.
متن کاملPii: S0925-7721(99)00016-4
Define a graph GT (n) with one node for each triangulation of a convex n-gon. Place an edge between each pair of nodes that differ by a single flip: two triangles forming a quadrilateral are exchanged for the other pair of triangles forming the same quadrilateral. In this paper we introduce a tree of all triangulations of polygons with any number of vertices which gives a unified framework in w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000